253A - Boys and Girls - CodeForces Solution


greedy *1100

Please click on ads to support us..

Python Code:

Fi=open('input.txt','r')
Fo=open('output.txt','w')
n,m=map(int,Fi.readline().split())
S=''
Nb=m+n
if n>m:
    for i in range(Nb):
        if i%2==0 or m==0:
            S+='B'
        else:
            S+='G'
            m-=1
else:
    for i in range(Nb):
        if i%2==0 or n==0:
            S+='G'
        else:
            S+='B'
            n-=1
Fo.write(S)
Fi.close()
Fo.close()

C++ Code:

#include <bits/stdc++.h>
using namespace std;

int main()
{
    size_t n, m;

    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    cin >> n >> m;

    if (n >= m)
    {
        string s(n+m, 'B');
        for (size_t i = 1; i < m * 2; i += 2)
        {
            s[i] = 'G';
        }
        cout << s << endl;
    }
    else
    {
        string s(m+n, 'G');
        for (size_t i = 1; i < n * 2; i += 2)
        {
            s[i] = 'B';
        }
        cout << s << endl;
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1633C - Kill the Monster
1611A - Make Even
1030B - Vasya and Cornfield
1631A - Min Max Swap
1296B - Food Buying
133A - HQ9+
1650D - Twist the Permutation
1209A - Paint the Numbers
1234A - Equalize Prices Again
1613A - Long Comparison
1624B - Make AP
660B - Seating On Bus
405A - Gravity Flip
499B - Lecture
709A - Juicer
1358C - Celex Update
1466B - Last minute enhancements
450B - Jzzhu and Sequences
1582C - Grandma Capa Knits a Scarf
492A - Vanya and Cubes
217A - Ice Skating
270A - Fancy Fence
181A - Series of Crimes
1638A - Reverse
1654C - Alice and the Cake
369A - Valera and Plates
1626A - Equidistant Letters
977D - Divide by three multiply by two
1654B - Prefix Removals
1654A - Maximum Cake Tastiness